Load Balancing by Domain Decomposition: the Bounded Neighbors Approach
نویسنده
چکیده
This paper presents a new domain decomposition approach whose main goal is the computation of a load balancing partition while reducing the overhead to compute such a partition. In the proposed approach, the number of neighbours of each sub-domain returned by the decomposition can be bounded by an user supplied value. This reduces the communication overhead of the application. We describe an algorithm implementing our decomposition strategy and apply our approach to WaTOR, a classical dynamical simulation problem. We report also some preliminaries result to prove the effectiveness of our approach. keywords: Partitioning, Mapping, Load Balancing, Cluster Computing
منابع مشابه
Load Balancing by Domain Decomposition: the Bounded Neighbors Approach
This paper presents a new domain decomposition approach whose main goal is the computation of a load balancing partition while reducing the overhead to compute such a partition. In the proposed approach, the number of neighbours of each sub-domain returned by the decomposition can be bounded by an user supplied value. This reduces the communication overhead of the application. We describe an al...
متن کاملLoad Balancing by Domain Decomposition: the Bounded Neighbours Approach
This paper presents a new domain decomposition approach whose main goal is the computation of a load balancing partition while reducing the overhead to compute such a partition. In the proposed approach, the number of neighbours of each sub-domain produced by the decomposition can be bounded by an user supplied value. This reduces the communication overhead of the application. We describe an al...
متن کاملNumerical Implementation of Overlapping Balancing Domain Decomposition Methods on Unstructured Meshes
The Overlapping Balancing Domain Decomposition (OBDD) methods can be considered as an extension of the Balancing Domain Decomposition (BDD) methods to the case of overlapping subdomains. This new approach, has been proposed and studied in [4, 3]. In this paper, we will discuss its practical parallel implementation and present numerical experiments on large unstructured meshes.
متن کاملEecient Implementation of a 3-dimensional Adi Method on the Ipsc/860
A comparison is made between several domain decomposition strategies for the solution of three-dimensional partial diierential equations on a MIMD distributed memory parallel computer. The grids used are structured, and the numerical algorithm is ADI. Important implementation issues regarding load balancing, storage requirements, network latency, and overlap of computations and communications a...
متن کاملEvaluation of Parallel Domain Decomposition Algorithms
In this talk we describe and evaluate several heuristics for the parallel decomposition of data into n processors. This problem is usually cast as a graph partitioning problem, requiring that each processor have equal amount of data, and that inter-processor communication be minimized. Since this problem is NP-complete, several heuristics have been developed: combinatorial, geometric, spectral,...
متن کامل